Satisfiability problems on intervals and unit intervals
نویسندگان
چکیده
منابع مشابه
Satisfiability Problems on Intervals and Unit Intervals
For an interval graph with some additional order constraints between pairs of non-intersecting intervals, we give a linear time algorithm to determine if there exists a realization which respects the order constraints. Previous algorithms for this problem (known also as seriation with side constraints) required quadratic time. This problem contains as subproblems interval graph and interval ord...
متن کاملConstraint Satisfaction Problems on Intervals and Lengths ∗
We study interval-valued constraint satisfaction problems (CSPs), in which the aim is to find an assignment of intervals to a given set of variables subject to constraints on the relative positions of intervals. Many well-known problems such as Interval Graph Recognition and Interval Satisfiability can be considered as examples of such CSPs. One interesting question concerning such problems is ...
متن کاملSome Problems on Random Intervals and Annihilating
BY P . ERDŐS AND P . NEY Hungarian Academy of Sciences and University of Wisconsin Particles perform independent random walks on the integers, and are annihilated if they cross paths or land at the same point. The problem is to determine whether the origin is hit infinitely often . The answer is shown to depend on the initial distribution of particles in accordance with a "log log law ." Severa...
متن کاملArchimedean Unital Groups with Finite Unit Intervals
Let G be a unital group with a finite unit interval E, let n be the number of atoms in E, and let κ be the number of extreme points of the state spaceΩ(G). We introduce canonical order-preserving group homomorphisms ξ : Zn → G and ρ : G → Zκ linking G with the simplicial groups Zn and Zκ . We show that ξ is a surjection and ρ is an injection if and only if G is torsion-free. We give an explicit...
متن کاملOn Unit Fractions with Denominators in Short Intervals
In this paper we pove that for any given rational r > 0 and all N > 1, there exist integers N < x 1 < x 2 < · · · < x k < e r+o(1) N such that r = 1 x 1 + 1 x 2 + · · · + 1 x k .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00208-3